A New Availability Concept for (n, k)-way Cluster Systems Regarding Waiting Time

نویسندگان

  • Kiejin Park
  • Sungsoo Kim
  • Jyh-Charn Liu
چکیده

It is necessary to have the precise definition of available performance of high availability systems that can represent the availability and performability of the systems altogether. However, the difference between numeric scales of availability and performance metrics such as waiting time makes quantitative evaluation difficult. A number of previous studies on availability do not include a performance metric in their availability modeling. In this paper, we propose a new availability model for (n,k)-way cluster systems which compose of n primary servers and k backup servers and compute the redundancy levels for the systems to satisfy both the requirements of availability and waiting time performance.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Preferred Primary Healthcare Provider Choice Among Insured Persons in Ashanti Region, Ghana

Background In early 2012, National Health Insurance Scheme (NHIS) members in Ashanti Region were allowed to choose their own primary healthcare providers. This paper investigates the factors that enrolees in the Ashanti Region considered in choosing preferred primary healthcare providers (PPPs) and direction of association of such factors with the choice of PPP.   Methods Using a cross-sectiona...

متن کامل

Availability of k-out-of-n: F Secondary Subsystem with General Repair Time Distribution

In this paper we study the steady state availability of main k-out-of-n: F and secondary subsystems having general repair time distribution. When more than k units of main subsystem fail, then the main subsystem shuts off the secondary subsystem. The life time distributions of the main units and that of secondary subsystem are exponentially distributed. A repair facility having single repairman...

متن کامل

DISCRETE-TIME GI/D-MSP/1/K QUEUE WITH N THRESHOLD POLICY

This paper presents a discrete-time single-server finite buffer N threshold policy queue with renewal input and discreteMarkovian service process. The server terminates service whenever the system becomes empty, and recommencesservice as soon as the number of waiting customers in the queue is N. We obtain the system-length distributionsat pre-arrival and arbitrary epochs using the supplementary...

متن کامل

Redundancy allocation problem for k-out-of-n systems with a choice of redundancy strategies

To increase the reliability of a specific system, using redundant components is a common method which is called redundancy allocation problem (RAP). Some of the RAP studies have focused on k-out-of-n systems. However, all of these studies assumed predetermined active or standby strategies for each subsystem. In this paper, for the first time, we propose a k-out-of-<em...

متن کامل

$G$-Frames for operators in Hilbert spaces

$K$-frames as a generalization of frames were introduced by L. Gu{a}vruc{t}a to study atomic systems on Hilbert spaces which allows, in a stable way, to reconstruct elements from the range of the bounded linear operator $K$ in a Hilbert space. Recently some generalizations of this concept are introduced and some of its difference with ordinary frames are studied. In this paper, we give a new ge...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003